Hilbert–Poincaré series of parity binomial edge ideals and permanental ideals of complete graphs
نویسندگان
چکیده
منابع مشابه
Binomial Edge Ideals of Graphs
We characterize all graphs whose binomial edge ideals have a linear resolution. Indeed, we show that complete graphs are the only graphs with this property. We also compute some graded components of the first Betti number of the binomial edge ideal of a graph with respect to the graphical terms. Finally, we give an upper bound for the Castelnuovo-Mumford regularity of the binomial edge ideal of...
متن کاملBinomial edge ideals and rational normal scrolls
Let $X=left( begin{array}{llll} x_1 & ldots & x_{n-1}& x_n\ x_2& ldots & x_n & x_{n+1} end{array}right)$ be the Hankel matrix of size $2times n$ and let $G$ be a closed graph on the vertex set $[n].$ We study the binomial ideal $I_Gsubset K[x_1,ldots,x_{n+1}]$ which is generated by all the $2$-minors of $X$ which correspond to the edges of $G.$ We show that $I_G$ is Cohen-Macaula...
متن کاملPermanental Ideals
We show that the (2 × 2)-subpermanents of a generic matrix generate an ideal whose height, unmixedness, primary decomposition, the number and structure of the minimal components, resolutions, radical, integral closure and Gröbner bases all depend on the characteristic of the underlying subfield: if the characteristic of the subfield is two, this ideal is the determinantal ideal for which all of...
متن کاملThe Regularity of Binomial Edge Ideals of Graphs
We prove two recent conjectures on some upper bounds for the Castelnuovo-Mumford regularity of the binomial edge ideals of some different classes of graphs. We prove the conjecture of Matsuda and Murai for chordal graphs. We also prove the conjecture due to the authors for a class of chordal graphs. We determine the regularity of the binomial edge ideal of the join of graphs in terms of the reg...
متن کاملOn the binomial edge ideals of block graphs
We find a class of block graphs whose binomial edge ideals have minimal regularity. As a consequence, we characterize the trees whose binomial edge ideals have minimal regularity. Also, we show that the binomial edge ideal of a block graph has the same depth as its initial ideal.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Collectanea Mathematica
سال: 2020
ISSN: 0010-0757,2038-4815
DOI: 10.1007/s13348-020-00294-2